Lexicographically first reduced words
نویسنده
چکیده
In this paper we investigate properties of a certain equivalence relation on reduced words in S, called Ca-equivalence. We combinatorially characterize the class of the lexicographically first reduced word of a permutation. We further show how this class is related to reduced words that are lattice words.
منابع مشابه
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
We give efficient algorithms for ranking Lyndon words of length n over an alphabet of size σ. The rank of a Lyndon word is its position in the sequence of lexicographically ordered Lyndon words of the same length. The outputs are integers of exponential size, and complexity of arithmetic operations on such large integers cannot be ignored. Our model of computations is the word-RAM, in which bas...
متن کاملTrellis Properties of Product Codes
In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis for their product code in minimal span form, also the tensor products of characteristic generators of two linear codes are the characteris...
متن کاملOrder and quasiperiodicity in episturmian words
In this paper, we build upon previous work concerning inequalities characterizing Sturmian and episturmian words – see [19, 29, 30, 14, 16]. First let us recall from [29] the following notion relating to lexicographic order. Let A be a totally ordered finite alphabet consisting of at least two letters. To any infinite word x over A, we can associate two infinite words min(x) and max(x) such tha...
متن کاملAvoiding squares and overlaps over the natural numbers
We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of avoiding squares, the word is 01020103 · · · , the familiar ruler function, and is generated by iterating a uniform morphism. The case of overlaps is more cha...
متن کاملExtremal Innnite Overlap-free Binary Words
Let t be the innnite xed point, starting with 1, of the morphism : 0 ! 01, 1 ! 10. An innnite word over f0;1g is said to be overlap-free if it contains no factor of the form axaxa, where a 2 f0;1g and x 2 f0;1g. We prove that the lexicographically least innnite overlap-free binary word beginning with any speciied preex, if it exists, has a suux which is a suux of t. In particular, the lexicogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 147 شماره
صفحات -
تاریخ انتشار 1995